Dynamic camera allocation method based on constraint satisfaction and cooperative search
نویسندگان
چکیده
In this paper, the dynamic allocation of camera resources for moving objects is presented as a model of partial constraint satisfaction problem. The purpose of the camera allocation is described as some simple constraint. The solution is reflexively searched in order to decide the allocation of each camera. The search neighborhood of the solution is limited to the partial solution for each camera. And, the constraint is relaxed for the partial solution of each camera, when the constraint is not satisfied. For a simple allocation problem, simulation was performed. The result of the simulation shows the efficiency of the proposal method.
منابع مشابه
Dynamic Cooperative Search for constraint satisfaction and combinatorial optimization : application to a rostering problem
In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of branching, called Dynamic Cooperative Search (DCS) inspired from the impact-based search method proposed in [7] for CSPs. This method defines in a dynamic way priority rules for variable and value sel...
متن کاملOptimal portfolio allocation with imposed price limit constraint
Daily price limits are adopted by many securities exchanges in countries such as the USA, Canada, Japan and various other countries in Europe and Asia, in order to increase the stability of the financial market. These limits confine the price of the financial asset during all trading stages of any trading day to a range, usually determined based on the previous day’s closing price. In this pape...
متن کاملConstraint Solving vs. Dynamic Reorganization for Task Allocation in Large Multi-agent Systems: Preliminary Results
We consider the problem of efficiently allocating complex tasks consisting of interdependent subtasks in large multiagent systems. Complex tasks are modeled as distributed constraint optimization problems and agent teams that can potentially serve them are located using a search method that efficiently combines overlay networks of gateways and routing indices. In this paper we make a preliminar...
متن کاملAllocation Algorithms in Dynamic Negotiation-Based Coalition Formation
In this paper, we present a set of allocation algorithms for a dynamic, negotiation-based coalition formation model. The model is for a cooperative multiagent system in which each agent has incomplete information about its dynamic and uncertain world and must respond to sensed events within time constraints. With incomplete information and uncertain world parameters while lacking time, an agent...
متن کاملPower Allocation In Cooperative Relay Channels
This paper concerns power allocation in relay-assisted wireless channels for two-hop transmission. First, the transmitter sends the information to both the relay and receiver parts. Next, in the second hop, the transmitter cooperates with the relay to increase the received signal to noise ratio (SNR), assuming the relay makes use of the Amplify and Forward (AF) strategy. Moreover, it is assumed...
متن کامل